Pareto Efficient Strategy-proof School Choice Mechanism with Minimum Quotas and Initial Endowments
نویسندگان
چکیده
This paper develops a strategy-proof and Pareto efficient mechanism for a school choice program called Top Trading Cycles among Representatives with Supplementary Seats (TTCR-SS). We consider a setting where minimum quotas are imposed for each school, i.e., a school is required to be assigned at least a certain number of students to operate, and the obtained matching must respect initial endowments, i.e., each student must be assigned to a school that is at least as good as her initial endowment school. Although minimum quotas are relevant in school choice programs and strategy-proofness is important to many policymakers, few existing mechanisms achieve both of them simultaneously. Furthermore, existing mechanisms require that all students consider all schools acceptable to obtain a feasible matching that respects minimum quotas and cannot guarantee Pareto efficiency. TTCR-SS is based on Top Trading Cycles (TTC) mechanism, while it is significantly extended to handle the supplementary seats of schools while respecting minimum quotas. Our simulation results show TTCR-SS is significantly better than an existing TTC-based mechanism in terms of students’ welfare.
منابع مشابه
Strategyproof Matching with Minimum Quotas and Initial Endowments: (Extended Abstract)
Although minimum quotas are important in many real-world markets, existing strategyproof mechanisms require an unrealistic assumption that all students consider all schools acceptable (and vice-versa). We develop a strategyproof matching mechanism called Priority-List based Deferred Acceptance mechanism with Minimum Quotas (PLDA-MQ), which works under more realistic assumptions: (i) a student c...
متن کاملStrategy-proof mechanisms for two-sided matching with minimum and maximum quotas
We consider the problem of allocating objects to agents when the objects have minimum quotas. There exist many realworld settings where minimum quotas are relevant. For example, in a hospital-resident matching problem, unconstrained matching may produce too few assignments to a rural hospital. Surprisingly, almost 50 years have passed after the seminal work by Gale and Shapley, no existing mech...
متن کاملNote on social choice allocation in exchange economies with many agents
In this paper we show that in pure exchange economies there exists no Pareto efficient and strategy-proof allocation mechanism which ensures positive consumptions to all agents. We also show that Pareto efficient, strategy-proof, and non-bossy allocation mechanism is dictatorial. We further show that if there exists three agents, then the allocation given by a Pareto efficient, strategy-proof, ...
متن کاملObvious Dominance and Random Priority
In environments without transfers, such as refugee resettlement, school choice, organ transplants, course allocation, and voting, we show that Random Priority is the unique mechanism that is obviously strategy-proof, Pareto efficient, and symmetric; hence providing an explanation for the popularity of this mechanism. We also construct the full class of obviously strategy-proof mechanisms, and e...
متن کاملCollege Admissions in China: A Mechanism Design Perspective
This paper justifies the evolution of the college admissions system in China from a mechanism design perspective. The sequential choice algorithm and the parallel choice algorithm used in the context of China’s college admissions system are formulated as the well-studied Boston mechanism and the Simple Serial Dictatorship mechanism. We review both theoretical and experimental mechanism design l...
متن کامل